runtime.hmap.B (field)

68 uses

	runtime (current package)
		map.go#L114: 	B         uint8  // log_2 of # of buckets (can hold up to loadFactor * 2^B items)
		map.go#L224: 	if h.B < 16 {
		map.go#L231: 	mask := uint32(1)<<(h.B-15) - 1
		map.go#L336: 	h.B = B
		map.go#L341: 	if h.B != 0 {
		map.go#L343: 		h.buckets, nextOverflow = makeBucketArray(t, h.B, nil)
		map.go#L432: 	m := bucketMask(h.B)
		map.go#L502: 	m := bucketMask(h.B)
		map.go#L546: 	m := bucketMask(h.B)
		map.go#L645: 	bucket := hash & bucketMask(h.B)
		map.go#L694: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map.go#L770: 	bucket := hash & bucketMask(h.B)
		map.go#L894: 	it.B = h.B
		map.go#L908: 	it.startBucket = r & bucketMask(h.B)
		map.go#L909: 	it.offset = uint8(r >> h.B & (abi.MapBucketCount - 1))
		map.go#L960: 		if h.growing() && it.B == h.B {
		map.go#L1103: 	markBucketsEmpty(h.buckets, bucketMask(h.B))
		map.go#L1126: 	_, nextOverflow := makeBucketArray(t, h.B, h.buckets)
		map.go#L1144: 	if !overLoadFactor(h.count+1, h.B) {
		map.go#L1149: 	newbuckets, nextOverflow := makeBucketArray(t, h.B+bigger, nil)
		map.go#L1156: 	h.B += bigger
		map.go#L1219: 	oldB := h.B
		map.go#L1677: 	if overLoadFactor(hint, src.B) {
		map.go#L1683: 		hint = int(loadFactorNum * (bucketShift(src.B) / loadFactorDen))
		map.go#L1698: 	if src.B == 0 && !(t.IndirectKey() && t.NeedKeyUpdate()) && !t.IndirectElem() {
		map.go#L1706: 	if dst.B == 0 {
		map.go#L1709: 	dstArraySize := int(bucketShift(dst.B))
		map.go#L1710: 	srcArraySize := int(bucketShift(src.B))
		map.go#L1727: 	oldB := src.B
		map.go#L1740: 		if oldB >= dst.B { // main bucket bits in dst is less than oldB bits in src
		map.go#L1741: 			dstBmap := (*bmap)(add(dst.buckets, (uintptr(i)&bucketMask(dst.B))*uintptr(t.BucketSize)))
		map.go#L1797: 	offset := uint8(r >> h.B & (abi.MapBucketCount - 1))
		map.go#L1798: 	if h.B == 0 {
		map.go#L1802: 	arraySize := int(bucketShift(h.B))
		map.go#L1860: 	offset := uint8(r >> h.B & (abi.MapBucketCount - 1))
		map.go#L1861: 	if h.B == 0 {
		map.go#L1865: 	arraySize := int(bucketShift(h.B))
		map_fast32.go#L25: 	if h.B == 0 {
		map_fast32.go#L30: 		m := bucketMask(h.B)
		map_fast32.go#L74: 	if h.B == 0 {
		map_fast32.go#L79: 		m := bucketMask(h.B)
		map_fast32.go#L134: 	bucket := hash & bucketMask(h.B)
		map_fast32.go#L176: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map_fast32.go#L233: 	bucket := hash & bucketMask(h.B)
		map_fast32.go#L275: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map_fast32.go#L319: 	bucket := hash & bucketMask(h.B)
		map_fast64.go#L25: 	if h.B == 0 {
		map_fast64.go#L30: 		m := bucketMask(h.B)
		map_fast64.go#L74: 	if h.B == 0 {
		map_fast64.go#L79: 		m := bucketMask(h.B)
		map_fast64.go#L134: 	bucket := hash & bucketMask(h.B)
		map_fast64.go#L176: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map_fast64.go#L235: 	bucket := hash & bucketMask(h.B)
		map_fast64.go#L277: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map_fast64.go#L321: 	bucket := hash & bucketMask(h.B)
		map_faststr.go#L25: 	if h.B == 0 {
		map_faststr.go#L81: 	m := bucketMask(h.B)
		map_faststr.go#L129: 	if h.B == 0 {
		map_faststr.go#L185: 	m := bucketMask(h.B)
		map_faststr.go#L245: 	bucket := hash & bucketMask(h.B)
		map_faststr.go#L295: 	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		map_faststr.go#L339: 	bucket := hash & bucketMask(h.B)